bed dtree dpurpos index structur string similar search base edit distanc adapt updat protocol reduc move object databas workload decad spatio tempor databas research focus design effect effici index structur support locat base queri predict rang queri nearest neighbor queri varieti index techniqu propos acceler process updat queri attent paid updat protocol import factor affect system perform paper propos gener adapt updat protocol move object databas number updat messag object databas server reduc workload system contrast approach adopt convent move object databas system exact locat veloc disclos predict motion propos concept spatio tempor safe region approxim futur locat spatio tempor safe region provid larger space toler move object free locat veloc updat long error remain predict databas answer predict queri accur server allow probe latest statu move object safe region inadequ return exact queri result spatio tempor safe region calcul optim databas server contradictori object reduc updat workload guarante queri accuraci effici achiev propos cost model estim composit activ passiv updat base histor motion record queri distribut conduct extens experi evalu propos varieti popular index structur result confirm viabil robust accuraci effici propos protocol effici effect similar search probabilist data base earth mover distanc understand mean shift sky gener framework extend skylin queri skylin queri data set multi dimension space decis make applic tradition object domin object dimens wors dimens skylin data set consist object domin object cater applic requir control size skylin handl data set structur work propos extend definit skylin base variant domin relationship view prolifer variant paper gener framework propos guid extens skylin queri convent definit variant framework explicitli carefulli examin properti preserv vari minim commun cost continu skylin mainten exist work skylin literatur focus optim process cost paper aim minim commun overhead client server architectur server continu maintain skylin dynam object contribut filter method avoid transmiss updat object influenc skylin specif object assign filter issu updat violat filter filter achiev signific save naiv approach transmit updat step introduc concept frequent skylin queri slide window fsqw motiv snapshot skylin stream environ chang time fsqw report object skylin recent timestamp lt filter easili adapt fsqw process potenti high overhead larg frequent updat dataset reduc commun cost propos sampl method return approxim fsqw result comput snapshot skylin final integr filter sampl hybrid approach combin individu advantag kernel dbase skylin cardin estim skylin dimension dataset consist point domin incorpor skylin oper practic databas system necessit effici effect cardin estim modul exist theoret work problem limit case dimens independ rare hold real dataset state art log sampl ls techniqu simpli appli theoret result independ dimens independ data lead larg estim error solv problem propos kernel base kb approach approxim skylin cardin nonparametr method extens experi real dataset demonstr kb achiev high accuraci case ls fail time numer natur effici kb compar ls extend ls kb domin skylin commonli convent skylin high dimension data effect index uncertain move object predict queri move object index queri process studi research topic applic area intellig transport system locat base servic exist work explicitli implicitli assum determinist object movement model real world object move complex stochast wai paper investig possibl marriag move object index probabilist object model distribut current locat veloc move object devis effici infer method predict futur locat demonstr predict seamlessli integr exist index structur design move object improv meaning rang nearest neighbor queri result highli dynam uncertain environ paper report extens experi tree offer insight properti paper propos similar search bregman diverg dmetric index paper examin problem index metric distanc function focu gener class distanc function bregman diverg support nearest neighbor rang queri distanc function kl diverg itakura saito distanc special case bregman diverg wide applic statist speech recognit time seri analysi unlik metric space kei properti triangl inequ distanc symmetri hold distanc function direct adapt exist index infrastructur develop metric space devis solut handl class distanc measur expand map point origin space extend space subsequ show state art tree base index method low moder dimension dataset vector approxim file va file method high dimension dataset adapt extend space answer queri effici improv distanc bound techniqu distribut base index optim introduc improv perform queri answer index construct appli tree va file extens experi conduct valid approach varieti dataset rang bregman diverg function domin game analysi microeconom data mine game theori power tool analysi competit manufactur market paper present studi combin game theori data mine introduc concept domin game analysi present multidimension market model dimens repres attribut commod product custom repres point multidimension space product domin custom attribut satisfi requir custom expect market share product measur expect number buyer custom equal bui product domin nash equilibrium configur product achiev stabl expect market share product prove nash equilibrium model comput polynomi time manufactur modifi product round robin manner improv effici comput design algorithm manufactur effici find respons product market uncertain cluster model method applic revisit cluster problem certainti uncertainti estim local optimum em algorithm gaussian mixtur model em algorithm popular iterationbas method estim paramet gaussian mixtur model larg observ set case em algorithm guarante converg global optimum stop local optimum wors global optimum requir run multipl procedur em algorithm initi configur return solut improv effici scheme propos method estim upper bound logarithm likelihood local optimum base current configur latest em iter accomplish deriv region bound locat local optimum upper bound estim maximum likelihood estim termin em algorithm procedur estim local optimum wors solut extens experi show method effect effici acceler convent multipl restart em algorithm continu dmean monitor move object high dimension skylin decis make applic skylin queri frequent find set domin data point call skylin point multidimension dataset high dimension space skylin point longer offer interest insight paper introduc metric call skylin frequenc compar rank interesting data point base return skylin number dimens subspac consid intuit point high skylin frequenc interest domin fewer combin dimens problem find top frequent skylin point algorithm propos skylin comput typic scale dimension frequent skylin comput requir skylin comput exponenti number subset dimens present effici approxim algorithm address twin difficulti extens perform studi show approxim algorithm run fast comput correct result larg data set high dimension space find ddomin skylin high dimension space fals neg approach mine frequent itemset high speed transact data stream relax space bound move object case buddi tree 